Binary matroids without prisms, prism duals, and cubes
نویسنده
چکیده
In this paper we determine completely the class of binary matroids with no minors isomor-phic to the cycle matroid of the prism graph M*(Ks\e), its dual M(Ks\e), and the binary affine cube AG(3, 2).
منابع مشابه
Continuum percolation for randomly oriented soft-core prisms.
We study continuum percolation of three-dimensional randomly oriented soft-core polyhedra (prisms). The prisms are biaxial or triaxial and range in aspect ratio over six orders of magnitude. Results for prisms are compared with studies for ellipsoids, rods, ellipses, and polygons and differences are explained using the concept of the average excluded volume, . For large-shape anisotropie...
متن کاملA Decomposition Theorem for Binary Matroids with no Prism Minor
The prism graph is the dual of the complete graph on five vertices with an edge deleted, K5\e. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by Dirac where he identified the simple 3-connected graphs with no minor isomorphic to the prism graph. We prove that besides Dirac’s infinite families of graphs and four inf...
متن کاملExcluding Kuratowski graphs and their duals from binary matroids
We consider various applications of our characterization of the internally 4-connected binary matroids with no M(K3,3)-minor. In particular, we characterize the internally 4-connected members of those classes of binary matroids produced by excluding any collection of cycle and bond matroids of K3,3 and K5, as long as that collection contains either M(K3,3) or M ∗(K3,3). We also present polynomi...
متن کاملPrism adaptation by mental practice.
The prediction of our actions and their interaction with the external environment is critical for sensorimotor adaptation. For instance, during prism exposure, which deviates laterally our visual field, we progressively correct movement errors by combining sensory feedback with forward model sensory predictions. However, very often we project our actions to the external environment without phys...
متن کاملA New Proof for a Result of Kingan and Lemos'
Williams, Jesse T. M.S., Department of Mathematics and Statistics, Wright State University, 2014. A New Proof for a Result of Kingan and Lemos. The prism graph is the planar dual of K5\e. Kingan and Lemos [4] proved a decomposition theorem for the class of binary matroids with no prism minor. In this paper, we present a different proof using fundamental graphs and blocking sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 152 شماره
صفحات -
تاریخ انتشار 1996